Mode-Directed Inverse Entailment for Full Clausal Theories

Inverse Entailment for Full Clausal Theories

This paper shows a sound and complete method for inverse entailment in inductive logic programming. We show that inverse entailment can be computed with a resolution method for consequencending. In comparison with previous work, induction via consequencending is sound and complete for nding hypotheses from full clausal theories, and can be used for inducing not only de nite clauses but also non...

Which Hypotheses Can Be Found with Inverse Entailment?

In this paper we give a completeness theorem of an inductive inference rule inverse entailment proposed by Muggleton. Our main result is that a hypothesis clause H can be derived from an example E under a background theory B with inverse entailment i H subsumes E relative to B in Plotkin's sense. The theory B can be any clausal theory, and the example E can be any clause which is neither a taut...

Comparison of Upward and Downward Generalizations in CF-Induction

CF-induction is a sound and complete procedure for finding hypotheses in full clausal theories. It is based on the principle of Inverse Entailment (IE), and consists of two procedures: construction of a bridge theory and generalization of it. There are two possible ways to realize the generalization task in CF-induction. The one uses a single deductive operator, called γ-operator, and the other...

Heuristic Inverse Subsumption in Full-Clausal Theories

Inductive Logic Programming: Inverse Resolution and Beyond

This talk is based on a paper which appears in the May 1995 issue of New Generation Computing Journal under the title "Inverse entailment and Progol." The paper is available as gzipped Postscript by anonymous ftp from ftp.comlab.ox.ac.uk in file pub/Packages/ILP/Papers/InvEnt.ps.gz The paper firstly provides a reappraisal of the development of techniques for inverting deduction, secondly introd...